Flow-Length Aware Cache Replacement Policy for Packet Processing Cache

Secure Hierarchy-Aware Cache Replacement Policy (SHARP)

In cache-based side channel attacks, a spy that shares a cache with a victim probes cache locations to extract information on the victim’s access patterns. For example, in evict+reload, the spy repeatedly evicts and then reloads a probe address, checking if the victim has accessed the address in between the two operations. While there are many proposals to combat these cache attacks, they all h...

A Cache-Partitioning Aware Replacement Policy for Chip Multiprocessors

Chip multiprocessors (CMPs) usually employ shared, lastlevel caches to use on-chip memory resources effectively. Unfortunately, conventional replacement policies applied to shared caches fail to partition memory resources among cores to achieve an optimal execution throughput. This paper presents a novel replacement policy that dynamically estimates how many misses would be eliminated if one mo...

Cooperative Cache Replacement Policy for MANETs

Mobile Adhoc Networks (MANETs) are autonomously structured multi-hop wireless links in peer to peer fashion without aid of any infrastructure network. In MANETs network topology is dynamic, as nodes are mobile. Due to this dynamic topology and multi-hop environment data availability in MANETs is low. Caching of frequently accessed data in ad hoc networks is a potential technique that can improv...

Popularity-Aware Cache Replacement in Streaming Environments

DRAM-Aware Last-Level Cache Replacement

The cost of last-level cache misses and evictions depend significantly on three major performance-related characteristics of DRAM-based main memory systems: bank-level parallelism, row buffer locality, and write-caused interference. Bank-level parallelism and row buffer locality introduce different latency costs for the processor to service misses: parallel or serial, fast or slow. Write-caused...